A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes
نویسندگان
چکیده
In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.
منابع مشابه
Properties of the longest-edge n-section refinement scheme for triangular meshes
The stability condition or non-degeneracy property means that the interior angles of all elements have to be bounded uniformly away from zero. Non-degeneracy is essential, for example, for the approximation properties of finite element spaces and the convergence behavior of multigrid and multilevel algorithms. Rosenberg and Stenger [1] showed the non-degeneracy property for LE-bisection: if α0 ...
متن کاملNon-degeneracy study of the 8-tetrahedra longest-edge partition
In this paper we show empirical evidence on the non-degeneracy property of the tetrahedral meshes obtained by iterative application of the 8-tetrahedra longest-edge (8T-LE) partition. The 8T-LE partition of an initial tetrahedron t yields an infinite sequence of tetrahedral meshes τ 1 = {t}, τ 2 = {t2 i }, τ 3 = {t3 i }, . . . . We give numerical experiments showing that for a standard shape me...
متن کاملA local refinement algorithm for the longest-edge trisection of triangle meshes
In this paper we present a local refinement algorithm based on the longest-edge trisection of triangles. Local trisection patterns are sed to generate a conforming triangulation, depending on the number of non-conforming nodes per edge presented. We describe he algorithm and provide a study of the efficiency (cost analysis) of the triangulation refinement problem. The algorithm presented, nd it...
متن کاملTwo-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n
In this work we study the diameters reduction rate for the iterative application of the longest edge (LE) n-section of triangles for n P 4. The maximum diameter dnk of all triangles generated at the kth iteration of the LE n-section is closely connected with the properties of the triangular mesh generated by this refinement scheme. The upper and the lower bounds for d2k were proved by Kearfott ...
متن کاملMultithread Lepp-Bisection Algorithm for Tetrahedral Meshes
Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 219 شماره
صفحات -
تاریخ انتشار 2012